The maximum node clustering problem
نویسندگان
چکیده
In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that the problem is strongly NP -complete and show that it can be approximated in polynomial time within a ratio arbitrarily close to 2. For the special case where the graph is a tree, we prove that the problem is weakly NP -complete as it generalizes the 0/1 Knapsack problem and is solvable in pseudopolynomial time by a dynamic programming approach. For this latter case an FPTAS is also presented.
منابع مشابه
An Artificial Bee Colony Inspired Clustering Solution to Prolong Lifetime of Wireless Sensor Networks
It is very difficult and expensive to replace sensor node battery in wireless sensor network in many critical conditions such as bridge supervising, resource exploration in hostile locations, and wildlife safety, etc. The natural choice in such situations is to maximize network lifetime. One such approach is to divide the sensing area of wireless sensor network into clusters to achieve high ene...
متن کاملModelling and Solving the Capacitated Location-Routing Problem with Simultaneous Pickup and Delivery Demands
In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...
متن کاملGeographic and Clustering Routing for Energy Saving in Wireless Sensor Network with Pair of Node Groups
Recently, wireless sensor network (WSN) is the popular scope of research. It uses too many applications such as military and non-military. WSN is a base of the Internet of Things (IoT), pervasive computing. It consists of many nodes which are deployed in a specific filed for sense and forward data to the destination node. Routing in WSN is a very important issue because of the limitation of the...
متن کاملHierarchal Grouping Strategy with Adaptive Power Tuning in ZigBee Wireless Sensor Networks
Designing wireless sensor networks should meet appropriate parameters such as quality of service (QoS) defined by different users. The variable physical conditions of the environment, processing and transmission power limitations and limited communication capabilities are the most important obstacles that influence QoS parameters such as throughput, delay, reliability and network lifetime. The ...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کامل